Maximum Spread of D-dimensional Multiple Turbo Codes Second revised version
نویسندگان
چکیده
This paper presents the mathematical framework involved in the determination of an upper bound of the maximum spread value of a D-dimensional Turbo-Code of frame size N. This bound is named Sphere Bound (SB). It is obtained using some simple properties of Euclidian space (sphere packing in a finite volume). The SB obtained for dimension 2 is equal to N. 2. This result has already been conjectured. For dimension 3, we prove that the SB cannot be reached, but can be closely approached (at least up to 95 %). For dimensions 4, 5 and 6, the construction of particular interleavers shows that SB can be approached up to 80%. Moreover, from the SB calculation, an estimate of the minimum Hamming weight of the weight-two input sequence is derived.
منابع مشابه
Multiple Turbo Codes
In this paper, we introduce multiple turbo codes and a suitable decoder structure derived from an approximation to the maximum a posteriori probability (MAP) decision rule, which is substantially different from the decoder for two-code-based encoders. We developed new rate 1/3 and 2/3 constituent codes to be used in the turbo encoder structure. These codes, for 2 to 32 states, are designed by u...
متن کاملAbout Symmetric Convolutional Codes of Memory Two and Three Used in Space-time Turbo Coding
In this paper are analysed the performances of different symmetric convolutional turbo codes for a transmission system that uses a doubly iterative decoding algorithm, with multiple antenna diversity. The turbo encoder uses an '–QPP (Quadratic–Permutation–Polynomial) interleaver, and two different decoding algorithms, namely, the Max–Log–APP (Maximum– Logarithm–A–Posteriori–Probability) algori...
متن کاملNonlinear Turbo Codes for the AWGN Channel with Higher-Order Modulations and the OR Multiple Access Channel
This paper addresses the problem of designing parallel concatenated nonlinear trellis codes (PC-NLTCs). These codes have advantages over binary linear turbo codes for higher-order modulations or in applications where a non-uniform distribution of ones and zeros in the output is optimal. Two applications are considered in this work. First, this paper shows that for higher-order modulations using...
متن کاملTurbo Lattices: Construction and Performance Analysis
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers and nested convolutional codes is built. To this end,...
متن کاملDesign of Three-Dimensional Multiple Slice Turbo Codes
This paper proposes a new approach to designing low-complexity high-speed turbo codes for very low frame error rate applications. The key idea is to adapt and optimize the technique of multiple turbo codes to obtain the required frame error rate combined with a family of turbo codes, called multiple slice turbo codes (MSTCs), which allows high throughput at low hardware complexity. The proposed...
متن کامل